Undirected graph

noun

noun ·Rare ·Advanced level

Definitions

Noun
  1. 1
    A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).
  2. 2
    In mathematics, a graph in which edges have no orientation. wordnet